On the parameterized vertex cover problem for graphs with perfect matching
نویسندگان
چکیده
منابع مشابه
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant less than 2. In this paper, we study the Vertex Cover problem on graphs with perfect matching (shortly, VC-PM). We show that if the VC-PM problem has a polynomial time approximation algorithm with approximation ratio bo...
متن کاملParameterized Streaming: Maximal Matching and Vertex Cover
As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one. However, few results are known for optimization problems over such dynamic graph streams. In this paper, we introduce a new approach to handling graph strea...
متن کاملApproximated Vertex Cover for Graphs with Perfect Matchings
Chen and Kanj considered the V C problem for graphs with perfect matchings (VC-PM). They showed that: (i) There is a reduction from general V C to VC-PM, which guarantees that if one can achieve an approximation factor of less than two for VC-PM, then one can do so for general V C as well. (ii) There is an algorithm for VC-PM whose approximation factor is given as 1.0...
متن کاملAlgorithms for the Vertex Cover Problem on Large Graphs
In a classical treatment of an optimization graph problem, the whole graph is available in the machine. It can be modified, updated (vertices can be marked, edges deleted, etc.) and the solution can be stored. However, many applications produce now data that are too large and are impossible to store and treat in this model. We focus in this paper on the treatment of the classical NP-complete mi...
متن کاملThe robust vertex centdian location problem with interval vertex weights on general graphs
In this paper, the robust vertex centdian location problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max regret criterion. This problem is investigated with objective function contains $lambda$ and a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2014
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-013-4845-2